An Algebra of Time-consuming Computations
نویسنده
چکیده
Structures for representing time-consuming computations are introduced and operations of composing such structures sequentially and in parallel are defined. Thus a monoidal category satisfying certain specific axioms of associativity and symmetry is obtained which is generated by a set of indecomposable time-consuming computations and in which the equality of morphisms is provable from axioms. Within this category one can represent behaviours of timed Petri nets.
منابع مشابه
Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملSpace Vector Modulation Based on Classification Method in Three-Phase Multi-Level Voltage Source Inverters
Pulse Width Modulation (PWM) techniques are commonly used to control the output voltage and current of DC to AC converters. Space Vector Modulation (SVM), of all PWM methods, has attracted attention because of its simplicity and desired properties in digital control of Three-Phase inverters. The main drawback of this PWM technique is 
its complex and time-consuming computations in real-time ...
متن کاملSpace Vector Modulation Based on Classification Method in Three-Phase Multi-Level Voltage Source Inverters
Pulse Width Modulation (PWM) techniques are commonly used to control the output voltage and current of DC to AC converters. Space Vector Modulation (SVM), of all PWM methods, has attracted attention because of its simplicity and desired properties in digital control of Three-Phase inverters. The main drawback of this PWM technique is its complex and time-consuming computations in real-time im...
متن کاملAspects of Large Scale Symbolic Computation Management
The special-purpose computer algebra system FELIX is designed for computations in constructive commutative and non-commutative algebra. In this paper we discuss some features of the system supporting the computation of rather complex problems, especially standard basis computations, using standard hardware. There is a rst aspect concerning the de nition and implementation of the basic data type...
متن کاملImproving Suzuki-Sato’s CGS Algorithm by Using Stability of Gröbner Bases and Basic Manipulations for Efficient Implementation
In this paper, we propose improving Suzuki-Sato’s algorithm for computing CGS. This paper consists of two parts. In the first part, using known algebraic manipulations on affine varieties, we describe a detail of basic manipulations to improve Suzuki-Sato’s algorithm. In the second part, we present a new algorithm which improves Nabeshima’s approach to compute a CGS. Nabeshima’s approach uses G...
متن کامل